منابع مشابه
Clustering in random line graphs
We investigate the degree distribution P (k) and the clustering coefficient C of the line graphs constructed on the Erdös-Rényi networks, the exponential and the scale-free growing networks. We show that the character of the degree distribution in these graphs remains Poissonian, exponential and power law, respectively, i.e. the same as in the original networks. When the mean degree < k > incre...
متن کاملRandom graphs with clustering.
We offer a solution to a long-standing problem in the theory of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity--the propensity for two neighbors of a network node also to be neighbors of one another. We show how standard random-graph models can be generalized to incorporate clustering and give exact solutions for various properties of...
متن کاملSparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edges are far from independent, and to prove several results about this extension. The basic idea is to construct the random graph by adding not only edges but also other small graphs. In other words, we first construct an...
متن کاملThe effect of clustering in random graphs
The goal of this thesis is to extend the configuration model to arbitrarily sized clusters and furthermore to a graph after bond percolation. To achieve this we first explain the configuration model and the model for graphs with single edges and triangles. Where in the latter model we already see some results of the effect of clustering on the size of the giant component. This is then extended ...
متن کاملThe effect of clustering in random graphs
The goal of this thesis is to extend the configuration model to arbitrarily sized clusters and furthermore to a graph after bond percolation. To achieve this we first explain the configuration model and the model for graphs with single edges and triangles. Where in the latter model we already see some results of the effect of clustering on the size of the giant component. This is then extended ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2010
ISSN: 0010-4655
DOI: 10.1016/j.cpc.2009.09.010